On Matroid Properties Definable in the MSO Logic
نویسنده
چکیده
It has been proved by the author that all matroid properties definable in the monadic second-order (MSO) logic can be recognized in polynomial time for matroids of bounded branch-width which are represented by matrices over finite fields. (This result extends so called “MS2-theorem” of graphs by Courcelle and others.) In this work we review the MSO theory of finite matroids and show some interesting matroid properties which are MSO-definable. In particular, all minorclosed properties are recognizable in such way.
منابع مشابه
Context-Free Graph Properties via Definable Decompositions
Monadic-second order logic (mso-logic) is successfully applied in both language theory and algorithm design. In the former, properties definable by mso-formulas are exactly the regular properties on many structures like, most prominently, strings. In the latter, solving a problem for structures of bounded tree width is routinely done by defining it in terms of an mso-formula and applying genera...
متن کاملA Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Streams
We discuss the completeness of an axiomatization of Monadic SecondOrder Logic (MSO) on infinite words (or streams). By using model-theoretic tools, we give an alternative proof of D. Siefkes’ result that a fragment with full comprehension and induction of second-order Peano’s arithmetic is complete w.r.t. the validity of MSO-formulas on streams. We rely on FefermanVaught Theorems and the Ehrenf...
متن کاملSeparating Graph Logic from MSO
Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of Monadic Second Order Logic (MSO), with quantification over sets of edges. We show that the containment is proper by exhibiting a property that is not GL definable but is definable in MSO, even in the absence of quantification o...
متن کاملMacro Tree Translations of Linear Size Increase are MSO Definable
The first main result is that if a macro tree translation is of linear size increase, i.e., if the size of every output tree is linearly bounded by the size of the corresponding input tree, then the translation is MSO definable (i.e., definable in monadic second-order logic). This gives a new characterization of the MSO definable tree translations in terms of macro tree transducers: they are ex...
متن کاملOrder-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers, allowing the expression of queries like “the number of elements in the structure is even”. The second extension allows the use of an additional binary predicate, n...
متن کامل